Genetic code, attributive mappings and stochastic matrices.
نویسنده
چکیده
In this paper we construct three primitive mappings based on three kinds of genetic attribute equivalences. We then apply the mappings and basic addition operation to the universal genetic code to generate three square matrices. We show that these square matrices are stochastic in nature. They demonstrate some fractal similarity properties and resemble the similar properties to the original stochastic matrices.
منابع مشابه
Genetic code, hamming distance and stochastic matrices.
In this paper we use the Gray code representation of the genetic code C=00, U=10, G=11 and A=01 (C pairs with G, A pairs with U) to generate a sequence of genetic code-based matrices. In connection with these code-based matrices, we use the Hamming distance to generate a sequence of numerical matrices. We then further investigate the properties of the numerical matrices and show that they are d...
متن کاملComputational method based on triangular operational matrices for solving nonlinear stochastic differential equations
In this article, a new numerical method based on triangular functions for solving nonlinear stochastic differential equations is presented. For this, the stochastic operational matrix of triangular functions for It^{o} integral are determined. Computation of presented method is very simple and attractive. In addition, convergence analysis and numerical examples that illustrate accuracy and eff...
متن کاملA Problem Relating to Positive Linear Maps on Matrix Algebras
As usually, a density matrix of M, is understood to be a non-negative matrix with trace equal to one. Thus, stochastic mappings are exactly those linear maps on M, which carry density matrices into density matrices. In this paper we shall deal with a particular case of the following problem concerning density matrices and stochastic transformations: Give necessary and sufficient conditions unde...
متن کاملDiffusion Matrices from Algebraic-Geometry Codes with Efficient SIMD Implementation
This paper investigates large linear mappings with very good diffusion and efficient software implementations, that can be used as part of a block cipher design. The mappings are derived from linear codes over a small field (typically F24 ) with a high dimension (typically 16) and a high minimum distance. This results in diffusion matrices with equally high dimension and a large branch number. ...
متن کاملE-Clean Matrices and Unit-Regular Matrices
Let $a, b, k,in K$ and $u, v in U(K)$. We show for any idempotent $ein K$, $(a 0|b 0)$ is e-clean iff $(a 0|u(vb + ka) 0)$ is e-clean and if $(a 0|b 0)$ is 0-clean, $(ua 0|u(vb + ka) 0)$ is too.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of mathematical biology
دوره 66 5 شماره
صفحات -
تاریخ انتشار 2004